Maximizing the Robustness of TDMA Networks with Applications to TTP/C
Identifieur interne : 006234 ( Main/Exploration ); précédent : 006233; suivant : 006235Maximizing the Robustness of TDMA Networks with Applications to TTP/C
Auteurs : Bruno Gaujal [France] ; Nicolas Navet [France]Source :
- Real-Time Systems [ 0922-6443 ] ; 2005-12-01.
Descripteurs français
- mix :
English descriptors
- KwdEn :
Abstract
Abstract: In this study we show how one can use Fault-Tolerant Units (FTU) in an optimal way to make a TDMA network robust to bursty random perturbations. We consider two possible objectives. If one wants to minimize the probability of losing all replicas of a given message, then the optimal policy is to spread the replicas over time. This is proved using convexity properties of the loss probability. On the contrary if one wants to minimize the probability of losing at least one replica, then the optimal solution is to group all replicas together. This is proved by using majorization techniques. Finally we show how these ideas can be adapted for the TTP/C protocol.
Url:
DOI: 10.1007/s11241-005-2743-4
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000A94
- to stream Istex, to step Curation: 000A88
- to stream Istex, to step Checkpoint: 001548
- to stream Hal, to step Corpus: 003129
- to stream Hal, to step Curation: 003129
- to stream Hal, to step Checkpoint: 004911
- to stream Main, to step Merge: 006459
- to stream Main, to step Curation: 006234
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Maximizing the Robustness of TDMA Networks with Applications to TTP/C</title><author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name></author><author><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2EF59593EB35F46BB4EC6DF5C44EF4599EB00E45</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/s11241-005-2743-4</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-CZ3VZKN9-R/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000A94</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000A94</idno><idno type="wicri:Area/Istex/Curation">000A88</idno><idno type="wicri:Area/Istex/Checkpoint">001548</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001548</idno><idno type="wicri:doubleKey">0922-6443:2005:Gaujal B:maximizing:the:robustness</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00099939</idno><idno type="url">https://hal.inria.fr/inria-00099939</idno><idno type="wicri:Area/Hal/Corpus">003129</idno><idno type="wicri:Area/Hal/Curation">003129</idno><idno type="wicri:Area/Hal/Checkpoint">004911</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">004911</idno><idno type="wicri:doubleKey">0922-6443:2005:Gaujal B:maximizing:the:robustness</idno><idno type="wicri:Area/Main/Merge">006459</idno><idno type="wicri:Area/Main/Curation">006234</idno><idno type="wicri:Area/Main/Exploration">006234</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Maximizing the Robustness of TDMA Networks with Applications to TTP/C</title><author><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>ID-IMAG Laboratory, 51 avenue Jean Kuntzmann, 38330, Montbonnot</wicri:regionArea><placeName><region type="region" nuts="2">Auvergne-Rhône-Alpes</region><region type="old region" nuts="2">Rhône-Alpes</region><settlement type="city">Montbonnot</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, Campus Scientifique, BP-139, 54506, Vandoeuvre</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandoeuvre</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Real-Time Systems</title><title level="j" type="sub">The International Journal of Time-Critical Computing Systems</title><title level="j" type="abbrev">Real-Time Syst</title><idno type="ISSN">0922-6443</idno><idno type="eISSN">1573-1383</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Boston</pubPlace><date type="published" when="2005-12-01">2005-12-01</date><biblScope unit="volume">31</biblScope><biblScope unit="issue">1-3</biblScope><biblScope unit="page" from="5">5</biblScope><biblScope unit="page" to="31">31</biblScope></imprint><idno type="ISSN">0922-6443</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0922-6443</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>TDMA</term><term>TTP/C</term><term>fault-tolerance</term><term>in-vehicle network</term><term>real-time systems</term><term>replica</term></keywords><keywords scheme="mix" xml:lang="fr"><term>fault tolerance</term><term>in-vehicle network</term><term>real-time systems</term><term>replica</term><term>réseau vehicule</term><term>station redondante</term><term>systèmes temps réel</term><term>tdma</term><term>tolérance aux fautes</term><term>ttp/c</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this study we show how one can use Fault-Tolerant Units (FTU) in an optimal way to make a TDMA network robust to bursty random perturbations. We consider two possible objectives. If one wants to minimize the probability of losing all replicas of a given message, then the optimal policy is to spread the replicas over time. This is proved using convexity properties of the loss probability. On the contrary if one wants to minimize the probability of losing at least one replica, then the optimal solution is to group all replicas together. This is proved by using majorization techniques. Finally we show how these ideas can be adapted for the TTP/C protocol.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Auvergne-Rhône-Alpes</li><li>Grand Est</li><li>Lorraine (région)</li><li>Rhône-Alpes</li></region><settlement><li>Montbonnot</li><li>Vandoeuvre</li></settlement></list><tree><country name="France"><region name="Auvergne-Rhône-Alpes"><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name></region><name sortKey="Gaujal, Bruno" sort="Gaujal, Bruno" uniqKey="Gaujal B" first="Bruno" last="Gaujal">Bruno Gaujal</name><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006234 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006234 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:2EF59593EB35F46BB4EC6DF5C44EF4599EB00E45
|texte= Maximizing the Robustness of TDMA Networks with Applications to TTP/C
}}
| This area was generated with Dilib version V0.6.33. |  |